µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)
Current Result Document :
ÇѱÛÁ¦¸ñ(Korean Title) |
±×·¡ÇÁ ºÐÇÒ ±â¹Ý RETE ³×Æ®¿öÅ© ºÐ»ê ó¸® |
¿µ¹®Á¦¸ñ(English Title) |
Distributed Processing of a RETE Network based on Graph Partitioning |
ÀúÀÚ(Author) |
ÃÖÇüÁÖ
À±¼ö½Ä
ÀÌÀç±æ
Hyeongju Choi
Susik Yoon
Jae-Gil Lee
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 33 NO. 02 PP. 0113 ~ 0126 (2017. 08) |
Çѱ۳»¿ë (Korean Abstract) |
RETE ³×Æ®¿öÅ©´Â »ý¼º ±ÔÄ¢ ¿£Áø (production rule engine)ÀÇ ÁÖ¿ä ±¸¼º¿ä¼Ò·Î¼, ÀԷµǴ µ¥ÀÌÅÍ ½ºÆ®¸²¿¡¼ Á¤ÀÇµÈ ±ÔÄ¢À» ºü¸£°Ô ŽÁöÇÑ ÈÄ ´ëÀÀµÇ´Â ÇൿÀ» ¼öÇàÇÏ´Â º¹ÇÕ À̺¥Æ® ó¸® (complex event processing)¸¦ À§ÇØ ³Î¸® »ç¿ëµÇ°í ÀÖ´Ù. ÃÖ±Ù »ç¹°ÀÎÅͳÝÀÇ ¹ßÀü, ¼Ò¼È ¹Ìµð¾î ¹× ¸ð¹ÙÀÏ ±â±âÀÇ ´ëÁßÈ·Î ÀÎÇØ ½ºÆ®¸² µ¥ÀÌÅÍ¿¡ ´ëÇÑ º¹ÇÕ À̺¥Æ® ó¸®ÀÇ ¼ö¿ä°¡ Áõ°¡ÇÏ°í ÀÖÀ¸¸ç, ƯÈ÷ ÀÔ·Â ½ºÆ®¸²ÀÇ ¾ç°ú ¼Óµµ°¡ Áõ°¡ÇÔ¿¡ µû¶ó Ŭ¶ó¿ìµå ȯ°æ¿¡¼ÀÇ ºÐ»ê ó¸®ÀÇ Çʿ伺 ¶ÇÇÑ ÇÔ²² ´ëµÎµÇ°í ÀÖ´Ù. RETE ³×Æ®¿öÅ©¸¦ ºÐ»ê ó¸®ÇÏ°íÀÚÇÑ ±âÁ¸ÀÇ ¿¬±¸¿¡¼´Â ´Ù¾çÇÑ °è»ê·®À» °¡Áö´Â ±ÔÄ¢µéÀ» È¿À²ÀûÀ¸·Î ºÐ¹èÇÏÁö ¸øÇß°í, ºÐ»ê 󸮿¡ »ç¿ëµÈ ¼¹ö°£ÀÇ ³×Æ®¿öÅ© Àü¼Û·® ¶ÇÇÑ °í·ÁÇÏÁö ¸øÇß´Ù. º» ³í¹®¿¡¼´Â ÀÌ¿Í °°Àº ¹®Á¦¸¦ ÇØ°áÇϱâ À§ÇØ ±×·¡ÇÁ ºÐÇÒ ±â¹ýÀ» ÀÌ¿ëÇÏ¿© RETE ³×Æ®¿öÅ©¸¦ ºÐ»ê ó¸®ÇÏ´Â ¹æ¹ýÀ» Á¦¾ÈÇÑ´Ù. Bisection spectral graph partitioningÀ» Àç±ÍÀûÀ¸·Î Àû¿ëÇÏ¿© °¢ ¼¹ö¿¡ °è»ê·®À» È¿À²ÀûÀ¸·Î ºÐ¹èÇÏ°í, ¼¹ö°£ ³×Æ®¿öÅ© »ç¿ë·® ¶ÇÇÑ ÃÖ¼ÒÈÇÏ¿´´Ù. ¼¼ Á¾·ùÀÇ ½ÇÁ¦ µ¥ÀÌÅ͸¦ »ç¿ëÇÏ¿© ±âÁ¸ ¿¬±¸ ´ëºñ º» ¹æ¹ýÀÌ Ã³¸®½Ã°£, ºÒ±ÕÇü Á¤µµ, ³×Æ®¿öÅ© »ç¿ë·® °üÁ¡¿¡¼ ¿ì¼öÇÔÀ» È®ÀÎÇÏ¿´´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
A RETE network is the main component of a production rule engine, which is mainly used for complex event processing to detect predefined rules against data stream and perform a corresponding action. Recently, the demand for complex event processing of stream data has increased due to advancements in Internet of Things, social media, and smartphone applications. At the same time, with growing size and input rate of stream data, the needs for a distributed processing is also increasing. The previous research on a distributed processing of a RETE network did not show efficient resource distribution and did not consider the cost of network usage. To deal with these problems, we proposed a distributed processing of a RETE network based on graph partitioning. More specifically, by recursively applying a bisection spectral graph partitioning algorithm on a RETE network, we distributed fair resources into each server and minimized the overall network usage. Performance experiments using three types of real data sets results better performances in terms of runtimes, degree of imbalance, and total network usage compared to the alternative algorithms.
|
Å°¿öµå(Keyword) |
RETE ³×Æ®¿öÅ©
º¹ÇÕ À̺¥Æ® ó¸®
ºÐ»ê º¹ÇÕ À̺¥Æ® ó¸®
RETE Network
Complex Event Processing
Distributed Complex Event Processing
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|